Exact Modeling of Binary Decision Diagram Complexity

The I/O - Complexity of Ordered Binary - Decision Diagram Manipulation

Ordered Binary-Decision Diagrams (OBDD) are the state-of-the-art data structure for boolean function manipulation and there exist several software packages for OBDD manipulation. OBDDs have been successfully used to solve problems in e.g. digital-systems design, verification and testing, in mathematical logic, concurrent system design and in artificial intelligence. The OBDDs used in many of th...

A Parallel Manipulation Method for Zero-suppressed Binary Decision Diagram

A parallel algorithm for the manipulation of Zero-suppressed Binary Decision Diagrams (ZBDDs) on a shared memory multi-processor system was described. Theoretical analysis showed that parallel manipulation of ZBDD has a better time performance than the sequential operation of ZBDD. Since the parallel ZBDD algorithm uses much less time than the ordinary ZBDD algorithm, a real-time calculation ca...

Some practical remarks about Binary Decision Diagram size reduction

In this paper the new spectral method of the variable ordering in the Binary Decision Diagram (BDD) is introduced. The problem to find the best order is defined as NP-hard, and optimal solution can not be finding because optimizing algorithm is running in O(n!2n) time, and calculations can not be done for the large n. Such complexity was obviously improved in many algorithms but as will be demo...

Ordered {AND, OR}-Decomposition and Binary-Decision Diagram

In the context of knowledge compilation (KC), we study the effect of augmenting Ordered Binary Decision Diagrams (OBDD) with two kinds of decomposition nodes, i.e., AND-vertices and OR-vertices which denote conjunctive and disjunctive decomposition of propositional knowledge bases, respectively. The resulting knowledge compilation language is called Ordered {AND, OR}-decomposition and binary-De...

WWW.BDD-PORTAL.ORG: An Experimentation Platform for Binary Decision Diagram Algorithms